Basic scheduling problems with raw material constraints

One of the achievements of scheduling theory is its contribution to practical applications in industrial settings. In particular, taking finiteness of the available production capacity explicitly into account, has been a major improvement of standard practice. Availability of raw materials, however, which is another important constraint in practice, has been largely disregarded in scheduling theory. This paper considers basic models for scheduling problems in contemporary manufacturing settings where raw material availability is of critical importance. We explore single scheduling machine problems, mostly with unit or all equal processing times, and L_max and C_max objectives. We present polynomial time algorithms, complexity and approximation results, and computational experiments. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Theories of Non-Balancing and Russia’s Foreign Policy

The beginning of the twenty-first century has witnessed the emergence of balancing responses to the US hegemony, among which Russia’s foreign policies stand out as corresponding to what is understood as ‘hard balancing.’ Why is the United States being balanced against? This paper categorizes the existing theories of non-balancing into six conditions that together guarantee the absence of balancing and demonstrates that the current unipolar system can satisfy only one of them. This eases the systemic constraints and makes balancing possible. The paper then presents three cases of balancing with reference to President Putin’s foreign policy. It argues that even though in terms of relative military capabilities unipolarity still holds, the emergence of counter-hegemonic balancing is indicative of important changes in the nature of post-Cold War American domination.     

Military Debt: Perspectives from the Experience of Arab Countries

The sectoral production function model of Feder (1983) has been widely used to examine the link between defence spending and economic growth. In this paper, the model, for which too much has been claimed in some past work, is examined, and the case is made for using growth in real non‐defence output rather than growth in real aggregate output (inclusive of military spending) as the dependent variable. Attention is restricted to a small group of OECD countries for which reliable labour force and capital stock (as well as defence) data are obtainable. With non‐defence output as the dependent variable and using only high quality data, no evidence in favour of the underconsumptionist (as opposed to the defence as a burden) position is found.     

Pricing bridges to cross a river

We consider a pricing problem in directed, uncapacitated networks. Tariffs must be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs in the network are assumed to be given. There are n clients, the followers, and after the tariffs have been determined, the clients route their demands independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by applications in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX‐hard. Moreover, we analyze the effect of uniform pricing, proving that it yields both an m approximation and a (1 + lnD)‐approximation. Here, D is upper bounded by the total demand of all clients. In addition, we consider the problem under the additional restriction that the operator must not reject any of the clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless P = NP, and we prove the existence of an n‐approximation algorithm. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

A Cryptographic Escrow for Treaty Declarations and Step-by-Step Verification

The verification of arms-control and disarmament agreements requires states to provide declarations, including information on sensitive military sites and assets. There are important cases, however, in which negotiations of these agreements are impeded because states are reluctant to provide any such data, because of concerns about prematurely handing over militarily significant information. To address this challenge, we present a cryptographic escrow that allows a state to make a complete declaration of sites and assets at the outset and commit to its content, but only reveal the sensitive information therein sequentially. Combined with an inspection regime, our escrow allows for step-by-step verification of the correctness and completeness of the initial declaration so that the information release and inspections keep pace with parallel diplomatic and political processes. We apply this approach to the possible denuclearization of North Korea. Such approach can be applied, however, to any agreement requiring the sharing of sensitive information.     

The strategy of the organisation of Ukrainian nationalists in its quest for a sovereign state, 1939–1950

ABSTRACT

The armed resistance offered by the Organization of Ukrainian Nationalists (OUN) to the Soviet state was the toughest internal political challenge that the Soviet regime faced from World War II to the 1980s. However, OUN’s grand strategy was based on self-delusion and was, therefore, always irrational. It resulted in misinterpretation of the sentiments of Ukrainians and the international situation, collaboration with Nazi Germany despite incompatible goals, counterproductive ethnic violence and sweeping terror against alleged Soviet collaborators. Local civilians rather than the representatives of the Soviet regime were OUN’s primary target; this alienated most residents of Western Ukraine.